منابع مشابه
Recurrence of Random Walk Traces
We show that the edges crossed by a random walk in a network form a recurrent graph a.s. In fact, the same is true when those edges are weighted by the number of crossings. §
متن کاملAsymptotic Density in a Coalescing Random Walk Model
We consider a system of particles, each of which performs a continuous time random walk on Z. The particles interact only at times when a particle jumps to a site at which there are a number of other particles present. If there are j particles present, then the particle which just jumped is removed from the system with probability pj . We show that if pj is increasing in j and if the dimension ...
متن کاملTwo-site Quantum Random Walk
We study the measure theory of a two-site quantum random walk. The truncated decoherence functional defines a quantum measure μn on the space of n-paths, and the μn in turn induce a quantum measure μ on the cylinder sets within the space Ω of untruncated paths. Although μ cannot be extended to a continuous quantum measure on the full σ-algebra generated by the cylinder sets, an important questi...
متن کاملTransience, recurrence and the speed of a random walk in a site-based feedback environment
We study a random walk on Z which evolves in a dynamic environment determined by its own trajectory. Sites flip back and forth between two modes, p and q. R consecutive right jumps from a site in the q-mode are required to switch it to the p-mode, and L consecutive left jumps from a site in the p-mode are required to switch it to the q-mode. From a site in the p-mode the walk jumps right with p...
متن کاملControlled random walk with a target site ∗
We consider a symmetric simple random walk {Wi} on Z, d = 1, 2, in which the walker may choose to stand still for a limited time. The time horizon is n, the maximum consecutive time steps which can be spent standing still is mn and the goal is to maximize P (Wn = 0). We show that for d = 1, if mn (logn) for some γ > 0, there is a strategy for each n yielding P (Wn = 0) → 1. For d = 2, if mn n f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2016
ISSN: 1083-589X
DOI: 10.1214/16-ecp5